Oberwolfach rectangular table negotiation problemFRONCEK, Dalibor.Discrete mathematics. 2009, Vol 309, Num 2, pp 501-504, issn 0012-365X, 4 p.Conference Paper

O(m log n) split decomposition of strongly-connected graphsJOERIS, Benson L; LUNDBERG, Scott; MCCONNELL, Ross M et al.Discrete applied mathematics. 2010, Vol 158, Num 7, pp 779-799, issn 0166-218X, 21 p.Article

Degree-constrained decompositions of graphs : Bounded treewidth and planarityBAZGAN, Cristina; TUZA, Zsolt; VANDERPOOTEN, Daniel et al.Theoretical computer science. 2006, Vol 355, Num 3, pp 389-395, issn 0304-3975, 7 p.Article

All graphs with maximum degree three whose complements have 4-cycle decompositionsFU, Chin-Mei; FU, Hung-Lin; RODGER, C. A et al.Discrete mathematics. 2008, Vol 308, Num 13, pp 2901-2909, issn 0012-365X, 9 p.Article

HIGH-LYING PROTON STRENGTHS OBSERVED IN STRIPPING REACTIONS1982; ; FRA; DA. 1982; IPNO-DRE/82-16; 11 P.-2 PL.; 30 CM; BIBL. 24 REF.Report

On decomposition of hypergraphs into △-systemsLONC, Z.Journal of combinatorial theory. Series A. 1989, Vol 52, Num 1, pp 158-162, issn 0097-3165Article

Decomposition of perfect graphsWEN-LIAN HSU.Journal of combinatorial theory. Series B. 1987, Vol 43, Num 1, pp 70-94, issn 0095-8956Article

Complete subgraphs of infinite multipartite graphs and antichains in partially oredered setsHAJNAL, A; SAUER, N.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 61-67, issn 0012-365XArticle

On universality of graphs with uniformly distributed edgesRODL, V.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 125-134, issn 0012-365XArticle

List partitions of chordal graphsFEDER, Tomas; HELL, Pavol; KLEIN, Sulamita et al.Lecture notes in computer science. 2004, pp 100-108, issn 0302-9743, isbn 3-540-21258-2, 9 p.Conference Paper

A decomposition for strongly perfect graphsOLARIU, S.Journal of graph theory. 1989, Vol 13, Num 3, pp 301-311, issn 0364-9024Article

A short proof of Kundu's k-factor theoremYONG-CHUAN CHEN.Discrete mathematics. 1988, Vol 71, Num 2, pp 177-179, issn 0012-365XArticle

Randomly decomposable graphsRUIZ, S.Discrete mathematics. 1985, Vol 57, Num 1-2, pp 123-128, issn 0012-365XArticle

On optimal ear-decompositions of graphsSZIGETI, Z.Lecture notes in computer science. 1999, pp 415-428, issn 0302-9743, isbn 3-540-66019-4Conference Paper

On bounds for the k-partitioning of graphsBEZRUKOV, S. L; ELSÄSSER, R; SCHROEDER, U.-P et al.Lecture notes in computer science. 1999, pp 154-163, issn 0302-9743, isbn 3-540-66200-6Conference Paper

A linear-time algorithm for finding tree-decompositions of small treewidthBODLAENDER, H. L.SIAM journal on computing (Print). 1996, Vol 25, Num 6, pp 1305-1317, issn 0097-5397Article

Using triangles to partition a diskKNOBLAUCH, T.Discrete mathematics. 1990, Vol 84, Num 2, pp 209-211, issn 0012-365XArticle

Decompositions of graphs into treesLONC, Z.Journal of graph theory. 1989, Vol 13, Num 4, pp 393-403, issn 0364-9024Article

A decomposition theory for matroids. IV: Decomposition of graphsTRUEMPER, K.Journal of combinatorial theory. Series B. 1988, Vol 45, Num 3, pp 259-292, issn 0095-8956Article

Law-free graphsOLARIU, S.Information processing letters. 1988, Vol 28, Num 1, pp 53-54, issn 0020-0190Article

The multiplicity of 1-factors in total graphsHENDRY, G. R. T.Discrete mathematics. 1988, Vol 70, Num 1, pp 21-25, issn 0012-365XArticle

Decompositions of hypergraphs into hyperstarsLONC, Z.Discrete mathematics. 1987, Vol 66, Num 1-2, pp 157-168, issn 0012-365XArticle

Parallel recognition and decomposition of two terminal series parallel graphsXIN HE; YESHA, Y.Information and computation (Print). 1987, Vol 75, Num 1, pp 15-38, issn 0890-5401Article

Hamiltonian decompositions of complete regular s-partite graphsHILTON, A. J. W; RODGER, C. A.Discrete mathematics. 1986, Vol 58, Num 1, pp 63-78, issn 0012-365XArticle

Sur un algorithme de sélection des éléments dans le traitement par convoyeurSAPATYJ, P. S.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 1, pp 132-135, issn 0002-3388Article